First-order query evaluation on structures of bounded degree
نویسندگان
چکیده
منابع مشابه
First-order query evaluation on structures of bounded degree
We consider the enumeration problem of first-order queries over structures of bounded degree. Durand and Grandjean have shown that this problem is in ConstantDelaylin. An enumeration problem belongs to Constant-Delaylin if for an input of size n it can be solved by (i) an O(n) precomputation phase building an index structure, followed by (ii) a phase enumerating the answers with no repetition a...
متن کاملFirst-order queries on classes of structures with bounded expansion
We consider the evaluation of first-order queries over classes of databases with bounded expansion. The notion of bounded expansion is fairly broad and generalizes bounded degree, bounded treewidth and exclusion of at least one minor. It was known that over a class of databases with bounded expansion, firstorder sentences could be evaluated in time linear in the size of the database. We give a ...
متن کاملFirst-Order Query Evaluation with Cardinality Conditions
We study an extension of first-order logic that allows to express cardinality conditions in a similar way as SQL’s COUNT operator. The corresponding logic FOC(P) was introduced by Kuske and Schweikardt [16], who showed that query evaluation for this logic is fixedparameter tractable on classes of databases of bounded degree. In the present paper, we first show that the fixed-parameter tractabil...
متن کاملAutomatic Structures of Bounded Degree Revisited
It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automatic presentations, this holds even uniformly). Presenting an automatic structure of bounded degree whose theory is hard for 2EXPSPACE, we also prove this result to be optimal. These findings close the gap left open in [14].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(2:20)2011